Coevolution of Machines and Tapes
نویسندگان
چکیده
A problem of self-referential paradox and self-reproduction is discussed in a network model of machines and tapes. A tape consists of a bit string, encoding function of a machine. Tapes are replicated when it is attached by an adequate machine. Generally, a tape is replicated but it may be di erent from the original one. In this paper, external noise evolves diversity in a system. New reaction pathway induced by external noise will be reproduced deterministically by an emerging autocatalytic network. Hence it will remain stable after external noise is turned o . Low external noise develops a minimal self-replicative loop. When external noise is elevated, a more complex network evolves, where a core structure emerges. Tapes in a core network can be bifurcated into either a RNAlike or a DNA-like tape with respect to its usage in an autocatalytic loop.
منابع مشابه
A Comparison of the Work Done by Generalized Sequential Machines and Turing Machines
For a long time it has been accepted that Turing machines are more powerful than generalized sequential machines. Since a generalized sequential machine is also a Turing machine, the class of Turing machines is at least as powerful as the class of generalized sequential machines. The purpose of this paper is to examine the adverb "more" from the aspect of work accomplished. Three manifestations...
متن کاملTangled Tapes: Infinity, Interaction and Turing Machines
In the sixty-five years since Turing introduced his eponymous machines, many popular misconceptions about their properties have become current. In this paper, we explore the notions that Turing machines have infinite tapes and that their expressive power is limited by by an inability to interact with the wider environment during computations.
متن کاملActive Mutation in Self-Reproducing Networks of Machines and Tapes
Self-reproduction via description is discussed in a network model of machines and description tapes. Tapes consist of bit strings, which encode the machines' function A tape is replicated when it is read by adequate machines. Generally, a machine rewrites a tape without doing correct replication. The variation in a reproduced tape is taken as mutation. Because this mutation is caused by a machi...
متن کاملReversal complexity revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several further tapes on which head reversals remain unrestricted, but size is bounded by s(n) (where n denotes the input length). Recently [9,10], such machines were introduced as a formalization of a computation model that restr...
متن کاملLog Space Machines with Multiple Oracle Tapes
As an alternative to previously studied models for space-bounded relative computation, an oracle Turing machine with a space bound on its worktape and an arbitrary number of oracle tapes is considered. Basic properties of the resulting reducibilities are examined.
متن کامل